Computational complexity theory
THEORETICAL COMPUTER SCIENCE AND MATHEMATICS THEORY THAT CLASSIFIES PROBLEMS ACCORDING TO THEIR INHERENT DIFFICULTY, AND RELATES THOSE CLASSES TO EACH OTHER
Intractable problem; Space complexity theory; Computationally intractable; Tractable problem; Computational intractability; Calculation complexity; Computational complexity analysis; Order of complexity; Order of computation; Complexity of algorithms; Feasible computation; Feasible computability; Intractably; Intractableness; Computationally infeasible; Complexity theory in computation; Complexity theory (computation); Continuous complexity theory; Intractability (complexity); Hierarchy theorem; Levin reduction; Computational infeasibility; History of computational complexity theory
In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource usage, and relating these classes to each other. A computational problem is a task solved by a computer.